topological sorting
英
美 [təpəˈlɑdʒɪkəl ˈsɔːrtɪŋ]
网络 拓扑排序; 拓扑分类; 拓朴排序; 拓扑排序算法
双语例句
- Topological sorting is another operation that can be modeled with graphs.
拓扑排序是可以用图模拟的另一种操作。 - The topological sorting algorithm works on unconnected graphs as well as connected graphs.
拓扑排序算法既可以用于连通图，也可以用于非连通图。 - Application of Topological Sorting Algorithm in Educational Administration System
拓扑排序算法在教务管理系统中的应用 - How is the acquisition of Chinese characters by learners from the non Chinese character cultural sphere affected by stroke numbers, component numbers and topological structural patterns On Stroke Sorting& and Anticlockwise Sorting of Mix-Structured Chinese Characters
笔画数、部件数和拓扑结构类型对非汉字文化圈学习者汉字掌握的影响 - A Topological Sorting in Partial Order Set
偏序集上的一种拓扑排序 - Routing Policy Conflicts Detecting Based on AOV Topological Sorting
基于AOV拓扑排序的路由策略冲突检测 - Algorithm for logit network loading problem based on topological sorting
基于拓扑处理的Logit型网络加载算法 - Moreover, another algorithm for testing conflicting routing policies based on topological sorting and counter-topological sorting method is introduced.
此外，本文还结合图论相关知识，利用拓扑排序和逆拓扑排序的方法对路由策略冲突检测问题进行研究，并提出了基于拓扑排序的路由策略冲突检测算法。 - On Group Topological Sorting Algorithm and Realization of Directed Graph
有向图的分组拓朴排序算法及实现 - Based on the characteristics of weighted DAG, the paper proposed an algorithm to solve the shortest path problems in the weighted DAG using topological sorting.
针对DAG的特点，以拓扑排序为基础，提出了解决DAG的最短路径问题的简单算法。 - A Distributed Algorithm for Topological Sorting
拓扑排序的分布式算法 - With the feedback of fusion graph in consideration, the requirements and characteristics of topological sorting for parallel prediction were analyzed, and an algorithm with comparatively small computational and storage complexities was proposed for the topological sort of fusion graphs.
结合融合图的反馈性，深入分析了并行性预测拓扑排序的要求和性质，提出了一种针对融合图进行并行性预测拓扑排序的实现算法，此算法的计算和存储复杂度都比较小。 - On this basis, presents a solution based on genetic algorithms, reducing the computation of repair individual illegal operation in genetic process, speeding up the convergence speed using the topological sorting in network plan.
在此基础上给出一种基于遗传算法的求解方法，在算法中有效地利用了网络计划图的拓扑排序，减少了遗传操作过程中非法个体的修复计算量，加快了算法的收敛速度。 - Although the result of a topological sorting is not unique, but the priority of the parent node is always higher than the priority of child nodes. Finally, this paper summarizes the research work and points out the further study.
虽然拓扑排序的结果并不唯一，但父结点的优先权始终高于子结点的优先权。本文最后对研究工作进行了总结，指出了今后需进一步深入研究的问题。